Improved Approximation Algorithms for Metric Facility Location Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Metric Facility Location Problems
In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...
متن کاملLocal Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems
We present a nested local search algorithm to approximate several variants of metric two-stage stochastic facility location problems. These problems are generalizations of the well-studied metric uncapacitated facility location problem, taking uncertainties in demand values and costs into account. The proposed nested local search procedure uses three facility operations: adding, dropping, and s...
متن کاملApproximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملPrimal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: O(m log m) and O(m logm(L+log(n))) respectively, where n and m are the total number of vertices and edges in the underlying graph. The main algorithmic idea...
متن کاملContinuumization and Approximation of Discrete Spatial Data for Optimal Facility Location Design
The paper proposes methodologies to convert discrete spatial data into continuous functions in a metric space so that the continuous approximation (CA) optimization framework can be applied to a general class of discrete facility location problems. We integrated a range of computational geometry methods to estimate the optimal system costs and the optimal number of facilities, and then develope...
متن کامل